graph reduction การใช้

• Until then, lazy languages had been implemented via interpreted graph reduction.
• Robichaud described this process of systematic flow-graph reduction:
• The usual implementation strategy for lazy evaluation in functional languages is graph reduction.
• Outermost graph reduction is referred to as lazy evaluation and innermost graph reduction is referred to as eager evaluation.
• Outermost graph reduction is referred to as lazy evaluation and innermost graph reduction is referred to as eager evaluation.
• Examples include the SKIM ( " S-K-I machine " ) computer, built at the University of Cambridge Computer Laboratory, and the multiprocessor GRIP ( " Graph Reduction In Parallel " ) computer, built at University College London.